Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings
نویسندگان
چکیده
We show that if a graph G is embedded in a surface 7 with representativity \, then G contains at least w(\&1)Â2x pairwise disjoint, pairwise homotopic, non-separating (in 7) cycles, and G contains at least w(\&1)Â8x&1 pairwise disjoint, pairwise homotopic, separating, noncontractible cycles. 1996 Academic Press, Inc.
منابع مشابه
Edge disjoint Paths in Graphs on Surfaces
We present a survey of results on the edge disjoint paths problem and re late this problem to the edge disjoint homotopic path and the edge disjoint homotopic cycle problem The latter problem is given a graph G V E embedded on a surface S and closed curves C Ck on S nd necessary and su cient conditions for the existence of pairwise edge disjoint cycles e C e Ck in G so that e Ci is homotopic to...
متن کاملShortest Co-cycle Bases of Graphs
In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connected graphs, which are related with map geometries, i.e., Smarandache 2dimensional manifolds. By using a Hall type theorem for base transformation, we show that the shortest co-cycle bases have the same structure (there is a 1-1 correspondence between two shortest co-cycle bases such that the corre...
متن کاملSeparating Cycles in Doubly Toroidal Embeddings
We show that every 4-representative graph embedding in the double torus contains a noncontractible cycle which separates the surface into two pieces. This improves a result of Zha and Zhao for general orientable surfaces, in which the same conclusion holds for 6-representative graph embeddings. Noncontractible separating cycles have been studied because they provide a way to do induction on the...
متن کاملComputing Interesting Topological Features
Many questions about homotopy are provably hard or even unsolvable in general. However, in specific settings, it is possible to efficiently test homotopyequivalence or compute shortest cycles with prescribed homotopy. We focus on computing such “interesting” topological features in three settings. The first two results are about cycles on surfaces; the third is about classes of homotopies in IR...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 66 شماره
صفحات -
تاریخ انتشار 1996